bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))
↳ QTRS
↳ DependencyPairsProof
bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))
BIN(s(x), s(y)) → BIN(x, s(y))
BIN(s(x), s(y)) → BIN(x, y)
bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
BIN(s(x), s(y)) → BIN(x, s(y))
BIN(s(x), s(y)) → BIN(x, y)
bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
BIN(s(x), s(y)) → BIN(x, s(y))
BIN(s(x), s(y)) → BIN(x, y)
The value of delta used in the strict ordering is 4.
POL(s(x1)) = 4 + (5/4)x_1
POL(BIN(x1, x2)) = x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
bin(x, 0) → s(0)
bin(0, s(y)) → 0
bin(s(x), s(y)) → +(bin(x, s(y)), bin(x, y))